A Mihalisin-Klee Theorem for Fans
نویسندگان
چکیده
The Mihalisin Klee Theorem states that an orientation of a 3-polytopal graph is induced by an affine function on some 3-polytope realizing the graph if the orientation is acyclic, has a unique source and a unique sink, and admits three independent monotone paths from the source to the sink. We replace the requirement that the orientation is acyclic with the assumption that it has no directed cycle contained in a face of the orientation, and show that such orientations are induced by 3-dimensional fans.
منابع مشابه
Geometric shellings of 3-polytopes
A total order of the facets of a polytope is a geometric shelling if there exists a combinatorially equivalent polytope in which the corresponding order of facets becomes a line shelling. The subject of this paper is (geometric) shellings of 3-polytopes. Recently, a graph theoretical characterization of geometric shellings of 3-polytopes were given by Holt & Klee and Mihalisin & Klee. We rst gi...
متن کاملRemarks on acyclic versions of generalized von Neumann and Nash equilibrium theorems
A fixed-point theorem on compact compositions of acyclic maps on admissible (in the sense of Klee) convex subset of a t.v.s. is applied to obtain a cyclic coincidence theorem for acyclic maps, generalized “onNeumann type intersection theorems, the Nash type equilibrium theorems, and the “onNeumann minimax theorem. Our new results generalize earlier works of Lassonde [l], Simons [2], and Park [3...
متن کاملThe Holt-Klee condition for oriented matroids
Holt and Klee have recently shown that every (generic) LP orientation of the graph of a d-polytope satisfies a directed version of the d-connectivity property, i.e. there are d internally disjoint directed paths from a unique source to a unique sink. We introduce two new classes HK and HK* of oriented matroids (OMs) by enforcing this property and its dual interpretation in terms of line shellin...
متن کاملAutomatic Test Generation for String Manipulation Programs using Symbolic Execution
S ymbolic execution of string manipulation programs is challenging as the constraint solvers do not typically support logic over strings and non-string operations. KLEE[1] is a symbolic execution tool used to generate test cases with high coverage. It uses Simple Theorem Prover (STP) as its constraint solver. STP encodes constraints only as bit-vector logic and solves the constraints. It has no...
متن کاملA Helly-type theorem for higher-dimensional transversals
We generalize the Hadwiger(-Danzer-Grünbaum-Klee) theorem on line transversals for an unbounded family of compact convex sets to the case of transversal planes of arbitrary dimension. This is the first Helly-type theorem known for transversals of dimension between 1 and d− 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 56 شماره
صفحات -
تاریخ انتشار 2016